Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
نویسندگان
چکیده
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decisions on a variety of online stochastic combinatorial problems in dynamic fleet management, reservation systems, and more. Here we consider applications in which the 1s-AA is not as close to the optimum and propose Amsaa, an anytime multi-step anticipatory algorithm. Amsaa combines techniques from three different fields to make decisions online. It uses the sampling average approximation method from stochastic programming to approximate the problem; solves the resulting problem using a search algorithm for Markov decision processes from artificial intelligence; and uses a discrete optimization algorithm for guiding the search. Amsaa was evaluated on a stochastic project scheduling application from the pharmaceutical industry featuring endogenous observations of the uncertainty. The experimental results show that Amsaa significantly outperforms state-of-theart algorithms on this application under various time constraints.
منابع مشابه
Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Programs
Despite significant algorithmic advances in recent years, finding optimal policies for large-scale, multistage stochastic combinatorial optimization problems remains far beyond the reach of existing methods. This paper studies a complementary approach, online anticipatory algorithms, that make decisions at each step by solving the anticipatory relaxation for a polynomial number of scenarios. On...
متن کاملAmsaa: an Anticipatory Algorithm for Online Stochastic Combinatorial Optimization List of Tables List of Figures Introduction: the Case for Online Stochastic Combinatorial Optimization 1.2 Talking into Account All Aspects of Osco Problems Can Yield Productivity Gains Motivation: Several Problems And
iv Acknowledgements A PhD dissertation might have only one author, but is certainty not the production of one person alone, and many deserve to be thanked today for their help, inspiration, or support. I discovered Operations Research thanks to Benoit Rottembourg, at the time director of the Bouygues e-lab. Philippe Baptiste, from CNRS/ ´ Ecole Polytechnique, advised me to come to Brown Univers...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملOnline Stochastic Optimization in the Large: Application to Kidney Exchange
Kidneys are the most prevalent organ transplants, but demand dwarfs supply. Kidney exchanges enable willing but incompatible donor-patient pairs to swap donors. These swaps can include cycles longer than two pairs as well, and chains triggered by altruistic donors. Current kidney exchanges address clearing (deciding who gets kidneys from whom) as an offline problem: they optimize the current ba...
متن کاملGap Reduction Techniques for Online Stochastic Project Scheduling
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such applications which typically feature purely exogenous uncertainty, the one-step anticipatory algorithm was shown theoretically to be close to optimal when the stochasticity of the problem, measured by the anticipatory...
متن کامل